Fuzzy machines in a category

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronous Machines: a Traced Category

Synchronous programming languages have been extensively used in the area of critical embedded systems. Synchronous machines, a specific class of labelled transition systems, are often used to give denotational semantics of these languages. In this work, we study the categorical structure of the aforementioned machines. We first show that the category S of synchronous machines can be given a tra...

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

Fuzzy logic models in a category of fuzzy relations

Then SetF(Ω) is a category with Ω-sets as objects and maps f : A → B such that γ(f(x), f(y)) ≥ δ(x, y) for all x, y ∈ A as morphisms f : (A, δ) → (B, γ). Moreover, by SetR(Ω) we understand a category which is an analogy of a category of sets with relations between sets as morphisms. Objects of this category SetR(Ω) are the same as in the category SetF(Ω) and morphism f : (A, δ) → (B, γ) are map...

متن کامل

Fuzzy Chemical Abstract Machines

Fuzzy set theory opens new vistas in computability theory and here I show this by defining a new computational metaphor—the fuzzy chemical metaphor. This metaphor is an extension of the chemical metaphor. In particular, I introduce the idea of a state of a system as a solution of fuzzy molecules, that is molecules that are not just different but rather similar, that react according to a set of ...

متن کامل

Fuzzy support vector machines

A support vector machine (SVM) learns the decision surface from two distinct classes of the input points. In many applications, each input point may not be fully assigned to one of these two classes. In this paper, we apply a fuzzy membership to each input point and reformulate the SVMs such that different input points can make different contributions to the learning of decision surface. We cal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1975

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700024412